A multiply constrained matroid optimization problem
نویسندگان
چکیده
منابع مشابه
solution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Approximation Algorithms for the Multiply Constrained Assignment Problem
We consider the multiply constrained assignment problem (MCAP), which is a variation of the linear assignment problem with m additional constraints. First, we derive upper and lower bounds respectively by heuristic and relaxation methods. The latter also implies the Lagrangian relaxation, as well. Next, we introduce the pegging test to MCAP, and further a virtual pegging test to reduce MCAP int...
متن کاملMotion tracking as a constrained optimization problem
In this paper we pose the problem of tracking of a varying number of points through an image sequence as a multi-objective optimization problem with additional hard constraints. One of the objectives is to 8nd smooth tracks based on second-order motion characteristics optimized over several frames. The corresponding optimization algorithm we present is a sequential heuristic search algorithm th...
متن کاملThe Phase Problem: A Problem in Constrained Global Optimization
It is now almost 200 years since Gauss, a teenager at the time, formulated his famous principle of least-squares and used it to determine, for the first time, the orbit of one of the asteroids, a problem which had defeated astronomers for years. When applied to the crystallographic phase problem, least-squares leads directly to the formulation of the minimal principle, which effectively replace...
متن کاملInverse Matroid Optimization Problem under the Weighted Hamming Distances
Given a matroid equipped with a utility vector to define a matroid optimization problem, the corresponding inverse problem is to modify the utility vector as little as possible so that a given base of the matroid becomes optimal to the matroid optimization problem. The modifications can be measured by various distances. In this article, we consider the inverse matroid problem under the bottlene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1988
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90149-5